./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '4675a6d019a62649b2c8ad57f2061f220679487a11c1dd453ecebcef9704015e'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4675a6d019a62649b2c8ad57f2061f220679487a11c1dd453ecebcef9704015e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:00:44,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:00:44,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:00:44,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:00:44,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:00:44,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:00:44,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:00:44,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:00:44,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:00:44,663 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:00:44,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:00:44,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:00:44,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:00:44,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:00:44,664 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:00:44,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:00:44,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:00:44,664 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:00:44,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:00:44,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:00:44,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:00:44,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:00:44,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:00:44,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:00:44,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:00:44,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:00:44,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:00:44,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:00:44,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:00:44,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:00:44,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:00:44,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:00:44,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:00:44,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:00:44,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:00:44,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:00:44,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:00:44,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:00:44,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:00:44,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:00:44,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:00:44,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:00:44,667 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4675a6d019a62649b2c8ad57f2061f220679487a11c1dd453ecebcef9704015e [2024-11-07 04:00:44,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:00:44,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:00:44,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:00:44,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:00:44,994 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:00:44,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i [2024-11-07 04:00:46,101 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:00:46,349 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:00:46,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i [2024-11-07 04:00:46,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6bc900c1/15021ff9f7eb4d9e859e733111a264b0/FLAG6d49502b2 [2024-11-07 04:00:46,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6bc900c1/15021ff9f7eb4d9e859e733111a264b0 [2024-11-07 04:00:46,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:00:46,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:00:46,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:00:46,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:00:46,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:00:46,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:00:46" (1/1) ... [2024-11-07 04:00:46,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bef37a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46, skipping insertion in model container [2024-11-07 04:00:46,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:00:46" (1/1) ... [2024-11-07 04:00:46,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:00:46,481 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i[919,932] [2024-11-07 04:00:46,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:00:46,543 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:00:46,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i[919,932] [2024-11-07 04:00:46,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:00:46,593 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:00:46,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46 WrapperNode [2024-11-07 04:00:46,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:00:46,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:00:46,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:00:46,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:00:46,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46" (1/1) ... [2024-11-07 04:00:46,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46" (1/1) ... [2024-11-07 04:00:46,639 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-11-07 04:00:46,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:00:46,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:00:46,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:00:46,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:00:46,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46" (1/1) ... [2024-11-07 04:00:46,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46" (1/1) ... [2024-11-07 04:00:46,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46" (1/1) ... [2024-11-07 04:00:46,671 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 04:00:46,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46" (1/1) ... [2024-11-07 04:00:46,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46" (1/1) ... [2024-11-07 04:00:46,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46" (1/1) ... [2024-11-07 04:00:46,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46" (1/1) ... [2024-11-07 04:00:46,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46" (1/1) ... [2024-11-07 04:00:46,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46" (1/1) ... [2024-11-07 04:00:46,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:00:46,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:00:46,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:00:46,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:00:46,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46" (1/1) ... [2024-11-07 04:00:46,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:00:46,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:00:46,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 04:00:46,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 04:00:46,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:00:46,748 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:00:46,748 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:00:46,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:00:46,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:00:46,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:00:46,815 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:00:46,816 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:00:47,048 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 04:00:47,048 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:00:47,058 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:00:47,059 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:00:47,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:00:47 BoogieIcfgContainer [2024-11-07 04:00:47,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:00:47,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:00:47,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:00:47,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:00:47,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:00:46" (1/3) ... [2024-11-07 04:00:47,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303f80b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:00:47, skipping insertion in model container [2024-11-07 04:00:47,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:46" (2/3) ... [2024-11-07 04:00:47,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303f80b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:00:47, skipping insertion in model container [2024-11-07 04:00:47,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:00:47" (3/3) ... [2024-11-07 04:00:47,066 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-75.i [2024-11-07 04:00:47,075 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:00:47,076 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:00:47,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:00:47,115 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@ade1a34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:00:47,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:00:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 04:00:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 04:00:47,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:00:47,127 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:00:47,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:00:47,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:00:47,130 INFO L85 PathProgramCache]: Analyzing trace with hash 130592195, now seen corresponding path program 1 times [2024-11-07 04:00:47,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:00:47,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877288092] [2024-11-07 04:00:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:00:47,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:00:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:00:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:00:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:00:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 04:00:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:00:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 04:00:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:00:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 04:00:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:00:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 04:00:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:00:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:00:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:00:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 04:00:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 04:00:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 04:00:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 04:00:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 04:00:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 04:00:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 04:00:47,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:00:47,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877288092] [2024-11-07 04:00:47,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877288092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:00:47,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:00:47,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:00:47,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186819799] [2024-11-07 04:00:47,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:00:47,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:00:47,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:00:47,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:00:47,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:00:47,427 INFO L87 Difference]: Start difference. First operand has 80 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 04:00:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:00:47,448 INFO L93 Difference]: Finished difference Result 153 states and 255 transitions. [2024-11-07 04:00:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:00:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 128 [2024-11-07 04:00:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:00:47,455 INFO L225 Difference]: With dead ends: 153 [2024-11-07 04:00:47,456 INFO L226 Difference]: Without dead ends: 76 [2024-11-07 04:00:47,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:00:47,462 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:00:47,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:00:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-07 04:00:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-07 04:00:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 04:00:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 113 transitions. [2024-11-07 04:00:47,497 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 113 transitions. Word has length 128 [2024-11-07 04:00:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:00:47,497 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 113 transitions. [2024-11-07 04:00:47,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 04:00:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 113 transitions. [2024-11-07 04:00:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 04:00:47,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:00:47,501 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:00:47,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:00:47,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:00:47,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:00:47,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1520115500, now seen corresponding path program 1 times [2024-11-07 04:00:47,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:00:47,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653164053] [2024-11-07 04:00:47,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:00:47,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:00:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:00:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:00:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:00:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 04:00:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:00:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 04:00:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:00:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 04:00:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:00:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 04:00:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:00:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:00:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:00:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 04:00:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 04:00:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 04:00:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 04:00:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 04:00:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 04:00:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:47,928 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 04:00:47,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:00:47,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653164053] [2024-11-07 04:00:47,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653164053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:00:47,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:00:47,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:00:47,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997852178] [2024-11-07 04:00:47,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:00:47,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:00:47,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:00:47,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:00:47,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:00:47,931 INFO L87 Difference]: Start difference. First operand 76 states and 113 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 04:00:48,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:00:48,005 INFO L93 Difference]: Finished difference Result 150 states and 225 transitions. [2024-11-07 04:00:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:00:48,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 129 [2024-11-07 04:00:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:00:48,008 INFO L225 Difference]: With dead ends: 150 [2024-11-07 04:00:48,008 INFO L226 Difference]: Without dead ends: 77 [2024-11-07 04:00:48,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:00:48,010 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:00:48,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:00:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-07 04:00:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-07 04:00:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 04:00:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2024-11-07 04:00:48,022 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 129 [2024-11-07 04:00:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:00:48,023 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2024-11-07 04:00:48,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 04:00:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2024-11-07 04:00:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 04:00:48,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:00:48,024 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:00:48,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:00:48,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:00:48,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:00:48,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2009450065, now seen corresponding path program 1 times [2024-11-07 04:00:48,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:00:48,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178358755] [2024-11-07 04:00:48,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:00:48,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:00:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:00:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:00:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:00:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 04:00:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:00:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 04:00:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:00:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 04:00:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:00:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 04:00:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:00:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:00:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:00:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 04:00:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 04:00:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 04:00:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 04:00:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 04:00:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 04:00:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 04:00:48,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:00:48,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178358755] [2024-11-07 04:00:48,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178358755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:00:48,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907948117] [2024-11-07 04:00:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:00:48,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:00:48,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:00:48,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 04:00:48,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 04:00:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:48,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 04:00:48,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:00:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 228 proven. 9 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-11-07 04:00:48,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:00:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 04:00:48,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907948117] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:00:48,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 04:00:48,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-07 04:00:48,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542693006] [2024-11-07 04:00:48,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 04:00:48,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 04:00:48,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:00:48,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 04:00:48,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:00:48,808 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 04:00:49,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:00:49,297 INFO L93 Difference]: Finished difference Result 202 states and 293 transitions. [2024-11-07 04:00:49,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 04:00:49,297 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 130 [2024-11-07 04:00:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:00:49,299 INFO L225 Difference]: With dead ends: 202 [2024-11-07 04:00:49,299 INFO L226 Difference]: Without dead ends: 128 [2024-11-07 04:00:49,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-07 04:00:49,301 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 276 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:00:49,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 234 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 04:00:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-07 04:00:49,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 80. [2024-11-07 04:00:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 04:00:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. [2024-11-07 04:00:49,320 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 130 [2024-11-07 04:00:49,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:00:49,320 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. [2024-11-07 04:00:49,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 04:00:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2024-11-07 04:00:49,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 04:00:49,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:00:49,323 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:00:49,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 04:00:49,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:00:49,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:00:49,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:00:49,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1515628271, now seen corresponding path program 1 times [2024-11-07 04:00:49,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:00:49,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846030968] [2024-11-07 04:00:49,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:00:49,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:00:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:00:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:00:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:00:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 04:00:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:00:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 04:00:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:00:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 04:00:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:00:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 04:00:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:00:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:00:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:00:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 04:00:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 04:00:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 04:00:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 04:00:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 04:00:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 04:00:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 04:00:49,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:00:49,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846030968] [2024-11-07 04:00:49,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846030968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:00:49,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068444158] [2024-11-07 04:00:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:00:49,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:00:49,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:00:49,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 04:00:49,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 04:00:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:00:49,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 04:00:49,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:00:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 228 proven. 9 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-11-07 04:00:50,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:00:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 04:00:50,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068444158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:00:50,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 04:00:50,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-07 04:00:50,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805864476] [2024-11-07 04:00:50,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 04:00:50,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 04:00:50,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:00:50,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 04:00:50,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-07 04:00:50,251 INFO L87 Difference]: Start difference. First operand 80 states and 108 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 04:00:50,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:00:50,700 INFO L93 Difference]: Finished difference Result 205 states and 279 transitions. [2024-11-07 04:00:50,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 04:00:50,700 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 131 [2024-11-07 04:00:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:00:50,703 INFO L225 Difference]: With dead ends: 205 [2024-11-07 04:00:50,705 INFO L226 Difference]: Without dead ends: 128 [2024-11-07 04:00:50,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2024-11-07 04:00:50,706 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 315 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:00:50,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 366 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 04:00:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-07 04:00:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 80. [2024-11-07 04:00:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 04:00:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2024-11-07 04:00:50,721 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 131 [2024-11-07 04:00:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:00:50,721 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2024-11-07 04:00:50,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 04:00:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2024-11-07 04:00:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 04:00:50,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:00:50,724 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:00:50,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 04:00:50,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:00:50,930 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:00:50,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:00:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash 233879002, now seen corresponding path program 1 times [2024-11-07 04:00:50,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:00:50,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943642020] [2024-11-07 04:00:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:00:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:00:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:00:50,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:00:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:00:51,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:00:51,043 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:00:51,044 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:00:51,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 04:00:51,047 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 04:00:51,119 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:00:51,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:00:51 BoogieIcfgContainer [2024-11-07 04:00:51,121 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:00:51,122 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:00:51,122 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:00:51,122 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:00:51,122 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:00:47" (3/4) ... [2024-11-07 04:00:51,124 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:00:51,125 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:00:51,125 INFO L158 Benchmark]: Toolchain (without parser) took 4751.09ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 91.4MB in the beginning and 135.4MB in the end (delta: -44.0MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-11-07 04:00:51,129 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:00:51,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.24ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 77.7MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:00:51,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.34ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 75.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:00:51,130 INFO L158 Benchmark]: Boogie Preprocessor took 53.97ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 73.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:00:51,130 INFO L158 Benchmark]: RCFGBuilder took 365.60ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 53.7MB in the end (delta: 19.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:00:51,130 INFO L158 Benchmark]: TraceAbstraction took 4060.12ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 53.1MB in the beginning and 135.5MB in the end (delta: -82.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:00:51,130 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 192.9MB. Free memory was 135.5MB in the beginning and 135.4MB in the end (delta: 69.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:00:51,131 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.55ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.24ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 77.7MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.34ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 75.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.97ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 73.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 365.60ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 53.7MB in the end (delta: 19.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4060.12ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 53.1MB in the beginning and 135.5MB in the end (delta: -82.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 192.9MB. Free memory was 135.5MB in the beginning and 135.4MB in the end (delta: 69.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of bitwiseOr at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryArithmeticFLOAToperation at line 78. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.6; [L23] float var_1_4 = 128.75; [L24] float var_1_5 = 25.125; [L25] float var_1_6 = 1000000.75; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] float var_1_15 = 25.75; [L32] double var_1_16 = 0.4; [L33] double var_1_17 = 0.0; [L34] double var_1_18 = 0.0; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 24.8; [L37] signed char var_1_21 = 1; [L38] double var_1_22 = 200.8; [L39] unsigned short int var_1_23 = 40076; [L40] unsigned short int var_1_24 = 8; [L41] unsigned long int var_1_25 = 2; [L42] double last_1_var_1_22 = 200.8; VAL [isInitial=0, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L129] RET updateLastVariables() [L130] CALL updateVariables() [L85] var_1_4 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L86] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L87] var_1_5 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_6=4000003/4, var_1_7=1] [L88] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_6=4000003/4, var_1_7=1] [L89] var_1_6 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L90] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L91] var_1_11 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L92] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L93] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L93] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L94] var_1_12 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L95] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L96] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L96] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L98] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L99] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L99] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L100] var_1_14 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L101] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L102] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L102] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L103] var_1_17 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L104] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L105] var_1_18 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L106] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L107] var_1_19 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L108] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L109] var_1_20 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L110] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L111] var_1_23 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L112] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L113] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L113] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L114] var_1_24 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_7=1] [L115] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_7=1] [L116] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_7=1] [L116] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_7=1] [L130] RET updateVariables() [L131] CALL step() [L46] COND TRUE ! (var_1_4 < 16.8f) [L47] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_6=1000000000005, var_1_7=1] [L49] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] COND TRUE (((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25 [L51] var_1_7 = ((var_1_11 && var_1_12) && var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L59] COND FALSE !(var_1_25 > var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L62] COND TRUE var_1_18 > (var_1_20 + (var_1_19 * var_1_17)) [L63] var_1_16 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L68] COND FALSE !(var_1_18 < (last_1_var_1_22 * var_1_4)) [L75] var_1_22 = var_1_20 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_1=318/5, var_1_20=1000000000006, var_1_21=1, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L77] COND TRUE (-1 <= var_1_25) || var_1_7 [L78] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=1, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L80] COND TRUE (- (var_1_17 + var_1_1)) >= var_1_16 [L81] var_1_21 = ((((-50) < 0 ) ? -(-50) : (-50))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=50, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR (((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13)))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=50, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L122-L123] return ((((((((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))) && ((! (var_1_4 < 16.8f)) ? (var_1_15 == ((float) var_1_6)) : 1)) && ((var_1_25 > var_1_25) ? (var_1_16 == ((double) ((((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_19) - var_1_20))) : ((var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) ? (var_1_16 == ((double) var_1_6)) : (var_1_16 == ((double) var_1_20))))) && (((- (var_1_17 + var_1_1)) >= var_1_16) ? (var_1_21 == ((signed char) ((((-50) < 0 ) ? -(-50) : (-50))))) : 1)) && ((var_1_18 < (last_1_var_1_22 * var_1_4)) ? (((var_1_23 - var_1_24) < var_1_25) ? (var_1_22 == ((double) var_1_5)) : (var_1_22 == ((double) var_1_17))) : (var_1_22 == ((double) var_1_20)))) && (var_1_25 == ((unsigned long int) var_1_23)) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=50, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=50, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 609 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 591 mSDsluCounter, 902 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 483 mSDsCounter, 323 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 788 IncrementalHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 323 mSolverCounterUnsat, 419 mSDtfsCounter, 788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 690 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 96 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 914 NumberOfCodeBlocks, 914 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1032 ConstructedInterpolants, 0 QuantifiedInterpolants, 1559 SizeOfPredicates, 4 NumberOfNonLiveVariables, 594 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 5418/5472 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 04:00:51,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4675a6d019a62649b2c8ad57f2061f220679487a11c1dd453ecebcef9704015e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:00:52,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:00:52,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:00:53,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:00:53,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:00:53,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:00:53,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:00:53,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:00:53,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:00:53,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:00:53,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:00:53,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:00:53,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:00:53,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:00:53,031 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:00:53,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:00:53,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:00:53,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:00:53,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:00:53,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:00:53,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:00:53,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:00:53,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:00:53,032 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:00:53,032 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:00:53,032 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:00:53,032 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:00:53,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:00:53,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:00:53,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:00:53,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:00:53,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:00:53,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:00:53,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:00:53,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:00:53,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:00:53,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:00:53,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:00:53,034 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:00:53,034 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:00:53,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:00:53,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:00:53,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:00:53,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:00:53,034 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4675a6d019a62649b2c8ad57f2061f220679487a11c1dd453ecebcef9704015e [2024-11-07 04:00:53,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:00:53,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:00:53,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:00:53,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:00:53,278 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:00:53,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i [2024-11-07 04:00:54,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:00:54,688 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:00:54,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i [2024-11-07 04:00:54,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/845ce015b/4adc0fe35be843b99dc1925240b3d191/FLAG4a8ff5103 [2024-11-07 04:00:54,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/845ce015b/4adc0fe35be843b99dc1925240b3d191 [2024-11-07 04:00:54,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:00:54,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:00:54,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:00:54,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:00:54,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:00:54,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:00:54" (1/1) ... [2024-11-07 04:00:54,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@273dd979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54, skipping insertion in model container [2024-11-07 04:00:54,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:00:54" (1/1) ... [2024-11-07 04:00:54,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:00:54,841 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i[919,932] [2024-11-07 04:00:54,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:00:54,895 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:00:54,902 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-75.i[919,932] [2024-11-07 04:00:54,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:00:54,938 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:00:54,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54 WrapperNode [2024-11-07 04:00:54,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:00:54,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:00:54,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:00:54,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:00:54,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54" (1/1) ... [2024-11-07 04:00:54,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54" (1/1) ... [2024-11-07 04:00:54,971 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-11-07 04:00:54,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:00:54,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:00:54,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:00:54,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:00:54,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54" (1/1) ... [2024-11-07 04:00:54,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54" (1/1) ... [2024-11-07 04:00:54,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54" (1/1) ... [2024-11-07 04:00:54,991 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 04:00:54,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54" (1/1) ... [2024-11-07 04:00:54,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54" (1/1) ... [2024-11-07 04:00:55,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54" (1/1) ... [2024-11-07 04:00:55,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54" (1/1) ... [2024-11-07 04:00:55,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54" (1/1) ... [2024-11-07 04:00:55,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54" (1/1) ... [2024-11-07 04:00:55,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:00:55,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:00:55,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:00:55,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:00:55,010 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54" (1/1) ... [2024-11-07 04:00:55,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:00:55,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:00:55,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 04:00:55,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 04:00:55,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:00:55,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:00:55,053 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:00:55,053 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:00:55,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:00:55,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:00:55,110 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:00:55,111 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:01:13,672 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 04:01:13,672 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:01:13,681 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:01:13,681 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:01:13,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:13 BoogieIcfgContainer [2024-11-07 04:01:13,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:01:13,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:01:13,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:01:13,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:01:13,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:00:54" (1/3) ... [2024-11-07 04:01:13,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758230e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:13, skipping insertion in model container [2024-11-07 04:01:13,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:54" (2/3) ... [2024-11-07 04:01:13,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758230e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:13, skipping insertion in model container [2024-11-07 04:01:13,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:13" (3/3) ... [2024-11-07 04:01:13,691 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-75.i [2024-11-07 04:01:13,703 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:01:13,703 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:01:13,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:01:13,767 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5cfc1cb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:01:13,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:01:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 04:01:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 04:01:13,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:01:13,778 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:01:13,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:01:13,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:01:13,781 INFO L85 PathProgramCache]: Analyzing trace with hash 271658895, now seen corresponding path program 1 times [2024-11-07 04:01:13,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:01:13,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140281911] [2024-11-07 04:01:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:01:13,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:01:13,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:01:13,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:01:13,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 04:01:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:01:14,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:01:14,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:01:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 04:01:14,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:01:14,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:01:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140281911] [2024-11-07 04:01:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140281911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:01:14,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:01:14,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:01:14,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550668400] [2024-11-07 04:01:14,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:01:14,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:01:14,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:01:14,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:01:14,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:01:14,368 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 04:01:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:01:14,386 INFO L93 Difference]: Finished difference Result 115 states and 195 transitions. [2024-11-07 04:01:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:01:14,387 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2024-11-07 04:01:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:01:14,391 INFO L225 Difference]: With dead ends: 115 [2024-11-07 04:01:14,391 INFO L226 Difference]: Without dead ends: 57 [2024-11-07 04:01:14,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:01:14,394 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:01:14,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:01:14,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-07 04:01:14,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-07 04:01:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 04:01:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2024-11-07 04:01:14,425 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 124 [2024-11-07 04:01:14,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:01:14,427 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2024-11-07 04:01:14,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 04:01:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2024-11-07 04:01:14,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 04:01:14,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:01:14,430 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:01:14,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 04:01:14,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:01:14,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:01:14,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:01:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1843537523, now seen corresponding path program 1 times [2024-11-07 04:01:14,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:01:14,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704563938] [2024-11-07 04:01:14,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:01:14,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:01:14,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:01:14,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:01:14,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 04:01:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:01:15,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 04:01:15,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:01:28,570 WARN L286 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 04:01:36,700 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 04:01:44,459 WARN L286 SmtUtils]: Spent 7.76s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 04:01:52,599 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 04:02:00,695 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 04:02:08,826 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 04:02:20,557 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 04:02:28,684 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)