./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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', '64bit', '--witnessprinter.graph.data.programhash', '5335ff3ae60d503c7989a0baf091bf4ee05fe6735e77308a3563d234056465f1'] 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/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 5335ff3ae60d503c7989a0baf091bf4ee05fe6735e77308a3563d234056465f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:57:45,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:57:45,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 01:57:45,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:57:45,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:57:45,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:57:45,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:57:45,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:57:45,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:57:45,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:57:45,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:57:45,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:57:45,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:57:45,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:57:45,417 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:57:45,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:57:45,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:57:45,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:57:45,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:57:45,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:57:45,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:57:45,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:57:45,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:57:45,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:57:45,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:57:45,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:57:45,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:57:45,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:57:45,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:57:45,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:57:45,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:57:45,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:57:45,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:57:45,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:57:45,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:57:45,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:57:45,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:57:45,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:57:45,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:57:45,419 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5335ff3ae60d503c7989a0baf091bf4ee05fe6735e77308a3563d234056465f1 [2024-11-07 01:57:45,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:57:45,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:57:45,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:57:45,620 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:57:45,620 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:57:45,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c [2024-11-07 01:57:46,745 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:57:46,967 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:57:46,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c [2024-11-07 01:57:46,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a8c26431/649b80d5a6984d8887b244536f3225f9/FLAG486b2b275 [2024-11-07 01:57:47,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a8c26431/649b80d5a6984d8887b244536f3225f9 [2024-11-07 01:57:47,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:57:47,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:57:47,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:57:47,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:57:47,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:57:47,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:57:47" (1/1) ... [2024-11-07 01:57:47,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4af77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47, skipping insertion in model container [2024-11-07 01:57:47,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:57:47" (1/1) ... [2024-11-07 01:57:47,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:57:47,455 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/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c[1175,1188] [2024-11-07 01:57:47,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:57:47,605 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:57:47,611 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/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c[1175,1188] [2024-11-07 01:57:47,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:57:47,718 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:57:47,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47 WrapperNode [2024-11-07 01:57:47,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:57:47,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:57:47,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:57:47,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:57:47,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47" (1/1) ... [2024-11-07 01:57:47,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47" (1/1) ... [2024-11-07 01:57:48,072 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3197 [2024-11-07 01:57:48,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:57:48,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:57:48,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:57:48,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:57:48,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47" (1/1) ... [2024-11-07 01:57:48,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47" (1/1) ... [2024-11-07 01:57:48,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47" (1/1) ... [2024-11-07 01:57:48,268 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 01:57:48,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47" (1/1) ... [2024-11-07 01:57:48,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47" (1/1) ... [2024-11-07 01:57:48,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47" (1/1) ... [2024-11-07 01:57:48,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47" (1/1) ... [2024-11-07 01:57:48,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47" (1/1) ... [2024-11-07 01:57:48,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47" (1/1) ... [2024-11-07 01:57:48,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:57:48,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:57:48,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:57:48,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:57:48,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47" (1/1) ... [2024-11-07 01:57:48,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:57:48,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:48,455 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 01:57:48,460 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 01:57:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:57:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:57:48,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:57:48,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:57:48,697 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:57:48,698 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:57:51,288 INFO L? ?]: Removed 1718 outVars from TransFormulas that were not future-live. [2024-11-07 01:57:51,288 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:57:51,321 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:57:51,321 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 01:57:51,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:57:51 BoogieIcfgContainer [2024-11-07 01:57:51,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:57:51,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:57:51,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:57:51,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:57:51,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:57:47" (1/3) ... [2024-11-07 01:57:51,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3185b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:57:51, skipping insertion in model container [2024-11-07 01:57:51,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:47" (2/3) ... [2024-11-07 01:57:51,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3185b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:57:51, skipping insertion in model container [2024-11-07 01:57:51,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:57:51" (3/3) ... [2024-11-07 01:57:51,328 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.anderson.1.prop1-func-interl.c [2024-11-07 01:57:51,338 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:57:51,338 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 01:57:51,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:57:51,408 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;@2744c362, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:57:51,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 01:57:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 1136 states, 1134 states have (on average 1.5052910052910053) internal successors, (1707), 1135 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 01:57:51,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:51,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:51,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:51,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:51,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1418999555, now seen corresponding path program 1 times [2024-11-07 01:57:51,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:51,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617745277] [2024-11-07 01:57:51,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:51,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:51,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617745277] [2024-11-07 01:57:51,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617745277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:51,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:51,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:57:51,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467369672] [2024-11-07 01:57:51,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:51,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:57:51,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:51,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:57:51,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:51,998 INFO L87 Difference]: Start difference. First operand has 1136 states, 1134 states have (on average 1.5052910052910053) internal successors, (1707), 1135 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:52,113 INFO L93 Difference]: Finished difference Result 2205 states and 3317 transitions. [2024-11-07 01:57:52,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:52,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-07 01:57:52,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:52,126 INFO L225 Difference]: With dead ends: 2205 [2024-11-07 01:57:52,126 INFO L226 Difference]: Without dead ends: 1135 [2024-11-07 01:57:52,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:52,131 INFO L432 NwaCegarLoop]: 1701 mSDtfsCounter, 0 mSDsluCounter, 3396 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5097 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:52,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5097 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2024-11-07 01:57:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2024-11-07 01:57:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 1.5035273368606703) internal successors, (1705), 1134 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1705 transitions. [2024-11-07 01:57:52,189 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1705 transitions. Word has length 59 [2024-11-07 01:57:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:52,189 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1705 transitions. [2024-11-07 01:57:52,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1705 transitions. [2024-11-07 01:57:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 01:57:52,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:52,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:52,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:57:52,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:52,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:52,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1041008749, now seen corresponding path program 1 times [2024-11-07 01:57:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:52,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452548142] [2024-11-07 01:57:52,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:52,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:52,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452548142] [2024-11-07 01:57:52,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452548142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:52,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:52,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:57:52,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801134549] [2024-11-07 01:57:52,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:52,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:57:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:52,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:57:52,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:52,401 INFO L87 Difference]: Start difference. First operand 1135 states and 1705 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:52,448 INFO L93 Difference]: Finished difference Result 2206 states and 3315 transitions. [2024-11-07 01:57:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:52,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-07 01:57:52,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:52,453 INFO L225 Difference]: With dead ends: 2206 [2024-11-07 01:57:52,453 INFO L226 Difference]: Without dead ends: 1137 [2024-11-07 01:57:52,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:52,456 INFO L432 NwaCegarLoop]: 1701 mSDtfsCounter, 0 mSDsluCounter, 3392 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5093 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:52,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5093 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2024-11-07 01:57:52,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1137. [2024-11-07 01:57:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1136 states have (on average 1.5026408450704225) internal successors, (1707), 1136 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1707 transitions. [2024-11-07 01:57:52,477 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1707 transitions. Word has length 60 [2024-11-07 01:57:52,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:52,478 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1707 transitions. [2024-11-07 01:57:52,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1707 transitions. [2024-11-07 01:57:52,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-07 01:57:52,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:52,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:52,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:57:52,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:52,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:52,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1108534556, now seen corresponding path program 1 times [2024-11-07 01:57:52,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:52,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005318371] [2024-11-07 01:57:52,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:52,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:52,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:52,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005318371] [2024-11-07 01:57:52,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005318371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:52,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:52,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:57:52,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596239039] [2024-11-07 01:57:52,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:52,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:57:52,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:52,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:57:52,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:52,660 INFO L87 Difference]: Start difference. First operand 1137 states and 1707 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:52,700 INFO L93 Difference]: Finished difference Result 2214 states and 3325 transitions. [2024-11-07 01:57:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:52,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-07 01:57:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:52,704 INFO L225 Difference]: With dead ends: 2214 [2024-11-07 01:57:52,704 INFO L226 Difference]: Without dead ends: 1143 [2024-11-07 01:57:52,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:57:52,708 INFO L432 NwaCegarLoop]: 1701 mSDtfsCounter, 4 mSDsluCounter, 3386 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5087 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:52,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5087 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:52,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2024-11-07 01:57:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1143. [2024-11-07 01:57:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.501751313485114) internal successors, (1715), 1142 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1715 transitions. [2024-11-07 01:57:52,725 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1715 transitions. Word has length 61 [2024-11-07 01:57:52,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:52,725 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1715 transitions. [2024-11-07 01:57:52,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1715 transitions. [2024-11-07 01:57:52,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 01:57:52,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:52,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:52,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:57:52,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:52,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1058890139, now seen corresponding path program 1 times [2024-11-07 01:57:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:52,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114708154] [2024-11-07 01:57:52,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:52,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:52,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114708154] [2024-11-07 01:57:52,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114708154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:52,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:52,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:57:52,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562504736] [2024-11-07 01:57:52,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:52,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:57:52,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:52,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:57:52,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:57:52,883 INFO L87 Difference]: Start difference. First operand 1143 states and 1715 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:52,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:52,947 INFO L93 Difference]: Finished difference Result 2224 states and 3337 transitions. [2024-11-07 01:57:52,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:57:52,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-07 01:57:52,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:52,952 INFO L225 Difference]: With dead ends: 2224 [2024-11-07 01:57:52,952 INFO L226 Difference]: Without dead ends: 1147 [2024-11-07 01:57:52,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:57:52,954 INFO L432 NwaCegarLoop]: 1701 mSDtfsCounter, 0 mSDsluCounter, 5069 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6770 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:52,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6770 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:57:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2024-11-07 01:57:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1143. [2024-11-07 01:57:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.501751313485114) internal successors, (1715), 1142 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1715 transitions. [2024-11-07 01:57:52,974 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1715 transitions. Word has length 62 [2024-11-07 01:57:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:52,975 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1715 transitions. [2024-11-07 01:57:52,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1715 transitions. [2024-11-07 01:57:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 01:57:52,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:52,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:52,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:57:52,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:52,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:52,977 INFO L85 PathProgramCache]: Analyzing trace with hash -625256907, now seen corresponding path program 1 times [2024-11-07 01:57:52,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:52,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378776579] [2024-11-07 01:57:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:53,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:53,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378776579] [2024-11-07 01:57:53,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378776579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:53,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:53,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:57:53,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688758948] [2024-11-07 01:57:53,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:53,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:57:53,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:53,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:57:53,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:57:53,203 INFO L87 Difference]: Start difference. First operand 1143 states and 1715 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:54,193 INFO L93 Difference]: Finished difference Result 3281 states and 4925 transitions. [2024-11-07 01:57:54,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:57:54,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-07 01:57:54,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:54,200 INFO L225 Difference]: With dead ends: 3281 [2024-11-07 01:57:54,200 INFO L226 Difference]: Without dead ends: 2204 [2024-11-07 01:57:54,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:57:54,202 INFO L432 NwaCegarLoop]: 1347 mSDtfsCounter, 1635 mSDsluCounter, 3954 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 5301 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:54,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 5301 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:57:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2024-11-07 01:57:54,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1174. [2024-11-07 01:57:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.5004262574595055) internal successors, (1760), 1173 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1760 transitions. [2024-11-07 01:57:54,224 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1760 transitions. Word has length 63 [2024-11-07 01:57:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:54,225 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1760 transitions. [2024-11-07 01:57:54,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1760 transitions. [2024-11-07 01:57:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-07 01:57:54,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:54,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:54,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:57:54,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:54,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:54,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1969110409, now seen corresponding path program 1 times [2024-11-07 01:57:54,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:54,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030960615] [2024-11-07 01:57:54,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:54,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:57:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:57:54,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:57:54,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030960615] [2024-11-07 01:57:54,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030960615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:57:54,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:57:54,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:57:54,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813811937] [2024-11-07 01:57:54,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:57:54,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:57:54,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:57:54,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:57:54,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:57:54,552 INFO L87 Difference]: Start difference. First operand 1174 states and 1760 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:55,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:57:55,425 INFO L93 Difference]: Finished difference Result 2266 states and 3398 transitions. [2024-11-07 01:57:55,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:57:55,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-07 01:57:55,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:57:55,429 INFO L225 Difference]: With dead ends: 2266 [2024-11-07 01:57:55,429 INFO L226 Difference]: Without dead ends: 1189 [2024-11-07 01:57:55,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:57:55,433 INFO L432 NwaCegarLoop]: 1326 mSDtfsCounter, 1668 mSDsluCounter, 3964 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 5290 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:57:55,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1668 Valid, 5290 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:57:55,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2024-11-07 01:57:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1187. [2024-11-07 01:57:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1186 states have (on average 1.4966273187183812) internal successors, (1775), 1186 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1775 transitions. [2024-11-07 01:57:55,449 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1775 transitions. Word has length 64 [2024-11-07 01:57:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:57:55,449 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1775 transitions. [2024-11-07 01:57:55,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:57:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1775 transitions. [2024-11-07 01:57:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:57:55,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:57:55,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:55,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:57:55,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:57:55,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:57:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash -593533898, now seen corresponding path program 1 times [2024-11-07 01:57:55,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:57:55,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910064593] [2024-11-07 01:57:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:57:55,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:57:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 01:57:55,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 01:57:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 01:57:55,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 01:57:55,563 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 01:57:55,563 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 01:57:55,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:57:55,567 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:57:55,610 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 01:57:55,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:57:55 BoogieIcfgContainer [2024-11-07 01:57:55,611 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 01:57:55,612 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 01:57:55,612 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 01:57:55,612 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 01:57:55,614 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:57:51" (3/4) ... [2024-11-07 01:57:55,615 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 01:57:55,615 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 01:57:55,617 INFO L158 Benchmark]: Toolchain (without parser) took 8301.11ms. Allocated memory was 100.7MB in the beginning and 369.1MB in the end (delta: 268.4MB). Free memory was 75.1MB in the beginning and 133.0MB in the end (delta: -57.9MB). Peak memory consumption was 215.2MB. Max. memory is 16.1GB. [2024-11-07 01:57:55,617 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 01:57:55,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.38ms. Allocated memory is still 100.7MB. Free memory was 74.8MB in the beginning and 61.3MB in the end (delta: 13.5MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-11-07 01:57:55,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 353.69ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 61.3MB in the beginning and 115.8MB in the end (delta: -54.4MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. [2024-11-07 01:57:55,618 INFO L158 Benchmark]: Boogie Preprocessor took 357.49ms. Allocated memory is still 201.3MB. Free memory was 115.8MB in the beginning and 93.7MB in the end (delta: 22.0MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2024-11-07 01:57:55,618 INFO L158 Benchmark]: RCFGBuilder took 2888.84ms. Allocated memory was 201.3MB in the beginning and 427.8MB in the end (delta: 226.5MB). Free memory was 93.7MB in the beginning and 213.6MB in the end (delta: -119.8MB). Peak memory consumption was 200.8MB. Max. memory is 16.1GB. [2024-11-07 01:57:55,618 INFO L158 Benchmark]: TraceAbstraction took 4289.01ms. Allocated memory was 427.8MB in the beginning and 369.1MB in the end (delta: -58.7MB). Free memory was 213.6MB in the beginning and 133.0MB in the end (delta: 80.5MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-07 01:57:55,618 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 369.1MB. Free memory was 133.0MB in the beginning and 133.0MB in the end (delta: 29.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 01:57:55,619 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.19ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.38ms. Allocated memory is still 100.7MB. Free memory was 74.8MB in the beginning and 61.3MB in the end (delta: 13.5MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 353.69ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 61.3MB in the beginning and 115.8MB in the end (delta: -54.4MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 357.49ms. Allocated memory is still 201.3MB. Free memory was 115.8MB in the beginning and 93.7MB in the end (delta: 22.0MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2888.84ms. Allocated memory was 201.3MB in the beginning and 427.8MB in the end (delta: 226.5MB). Free memory was 93.7MB in the beginning and 213.6MB in the end (delta: -119.8MB). Peak memory consumption was 200.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4289.01ms. Allocated memory was 427.8MB in the beginning and 369.1MB in the end (delta: -58.7MB). Free memory was 213.6MB in the beginning and 133.0MB in the end (delta: 80.5MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 369.1MB. Free memory was 133.0MB in the beginning and 133.0MB in the end (delta: 29.0kB). Peak memory consumption was 8.4MB. 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: 21]: 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 bitwiseAnd at line 149. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_16 = 0; [L40] const SORT_4 var_39 = 1; [L41] const SORT_4 var_40 = 0; [L42] const SORT_2 var_47 = 1; [L43] const SORT_3 var_49 = 0; [L44] const SORT_4 var_52 = 2; [L45] const SORT_2 var_62 = 0; [L47] SORT_1 input_48; [L48] SORT_1 input_56; [L49] SORT_1 input_63; [L50] SORT_1 input_69; [L51] SORT_1 input_95; [L52] SORT_1 input_99; [L53] SORT_1 input_102; [L54] SORT_1 input_103; [L55] SORT_1 input_109; [L56] SORT_1 input_115; [L57] SORT_1 input_130; [L58] SORT_1 input_148; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L60] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L61] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L62] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L63] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L64] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L65] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L66] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L67] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L68] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L69] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L70] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L71] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L72] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L73] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L74] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, var_16=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_5=0, var_62=0] [L75] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] SORT_2 init_7_arg_1 = var_5; [L78] state_6 = init_7_arg_1 [L79] SORT_2 init_9_arg_1 = var_5; [L80] state_8 = init_9_arg_1 [L81] SORT_2 init_11_arg_1 = var_5; [L82] state_10 = init_11_arg_1 [L83] SORT_2 init_13_arg_1 = var_5; [L84] state_12 = init_13_arg_1 [L85] SORT_2 init_15_arg_1 = var_5; [L86] state_14 = init_15_arg_1 [L87] SORT_1 init_18_arg_1 = var_16; [L88] state_17 = init_18_arg_1 [L89] SORT_1 init_20_arg_1 = var_16; [L90] state_19 = init_20_arg_1 [L91] SORT_1 init_22_arg_1 = var_16; [L92] state_21 = init_22_arg_1 [L93] SORT_1 init_24_arg_1 = var_16; [L94] state_23 = init_24_arg_1 [L95] SORT_1 init_26_arg_1 = var_16; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_28_arg_1 = var_16; [L98] state_27 = init_28_arg_1 [L99] SORT_1 init_30_arg_1 = var_16; [L100] state_29 = init_30_arg_1 [L101] SORT_1 init_32_arg_1 = var_16; [L102] state_31 = init_32_arg_1 [L103] SORT_1 init_34_arg_1 = var_16; [L104] state_33 = init_34_arg_1 [L105] SORT_1 init_36_arg_1 = var_16; [L106] state_35 = init_36_arg_1 [L107] SORT_1 init_38_arg_1 = var_16; [L108] state_37 = init_38_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L111] input_48 = __VERIFIER_nondet_uchar() [L112] input_56 = __VERIFIER_nondet_uchar() [L113] input_63 = __VERIFIER_nondet_uchar() [L114] input_69 = __VERIFIER_nondet_uchar() [L115] input_95 = __VERIFIER_nondet_uchar() [L116] EXPR input_95 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L116] input_95 = input_95 & mask_SORT_1 [L117] input_99 = __VERIFIER_nondet_uchar() [L118] EXPR input_99 & mask_SORT_1 VAL [input_95=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L118] input_99 = input_99 & mask_SORT_1 [L119] input_102 = __VERIFIER_nondet_uchar() [L120] EXPR input_102 & mask_SORT_1 VAL [input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L120] input_102 = input_102 & mask_SORT_1 [L121] input_103 = __VERIFIER_nondet_uchar() [L122] EXPR input_103 & mask_SORT_1 VAL [input_102=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L122] input_103 = input_103 & mask_SORT_1 [L123] input_109 = __VERIFIER_nondet_uchar() [L124] EXPR input_109 & mask_SORT_1 VAL [input_102=0, input_103=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L124] input_109 = input_109 & mask_SORT_1 [L125] input_115 = __VERIFIER_nondet_uchar() [L126] EXPR input_115 & mask_SORT_1 VAL [input_102=0, input_103=0, input_109=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L126] input_115 = input_115 & mask_SORT_1 [L127] input_130 = __VERIFIER_nondet_uchar() [L128] input_148 = __VERIFIER_nondet_uchar() [L131] SORT_1 var_41_arg_0 = state_25; [L132] SORT_4 var_41_arg_1 = var_39; [L133] SORT_4 var_41_arg_2 = var_40; [L134] SORT_4 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; [L135] SORT_1 var_42_arg_0 = state_35; [L136] SORT_4 var_42_arg_1 = var_39; [L137] SORT_4 var_42_arg_2 = var_40; [L138] SORT_4 var_42 = var_42_arg_0 ? var_42_arg_1 : var_42_arg_2; [L139] SORT_4 var_43_arg_0 = var_41; [L140] SORT_4 var_43_arg_1 = var_42; [L141] SORT_4 var_43 = var_43_arg_0 + var_43_arg_1; VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_43=0, var_47=1, var_49=0, var_52=2, var_62=0] [L142] EXPR var_43 & mask_SORT_4 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L142] var_43 = var_43 & mask_SORT_4 [L143] SORT_4 var_44_arg_0 = var_43; [L144] SORT_4 var_44_arg_1 = var_39; [L145] SORT_1 var_44 = var_44_arg_0 <= var_44_arg_1; [L146] SORT_1 var_45_arg_0 = ~state_37; VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_44=1, var_45_arg_0=-1, var_47=1, var_49=0, var_52=2, var_62=0] [L147] EXPR var_45_arg_0 & mask_SORT_1 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_44=1, var_47=1, var_49=0, var_52=2, var_62=0] [L147] var_45_arg_0 = var_45_arg_0 & mask_SORT_1 [L148] SORT_1 var_45_arg_1 = ~var_44; VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_45_arg_0=1, var_45_arg_1=-2, var_47=1, var_49=0, var_52=2, var_62=0] [L149] EXPR var_45_arg_1 & mask_SORT_1 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_45_arg_0=1, var_47=1, var_49=0, var_52=2, var_62=0] [L149] var_45_arg_1 = var_45_arg_1 & mask_SORT_1 [L150] EXPR var_45_arg_0 & var_45_arg_1 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L150] SORT_1 var_45 = var_45_arg_0 & var_45_arg_1; [L151] EXPR var_45 & mask_SORT_1 VAL [input_102=0, input_103=0, input_109=0, input_115=0, input_95=0, input_99=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_12=0, state_14=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_6=0, state_8=0, var_39=1, var_40=0, var_47=1, var_49=0, var_52=2, var_62=0] [L151] var_45 = var_45 & mask_SORT_1 [L152] SORT_1 bad_46_arg_0 = var_45; [L153] CALL __VERIFIER_assert(!(bad_46_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3307 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3307 mSDsluCounter, 32638 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23161 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3023 IncrementalHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 9477 mSDtfsCounter, 3023 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1187occurred in iteration=6, InterpolantAutomatonStates: 27, 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, 6 MinimizatonAttempts, 1036 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 434 NumberOfCodeBlocks, 434 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 363 ConstructedInterpolants, 0 QuantifiedInterpolants, 1015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 01:57:55,646 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/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 5335ff3ae60d503c7989a0baf091bf4ee05fe6735e77308a3563d234056465f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:57:57,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:57:57,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 01:57:57,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:57:57,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:57:57,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:57:57,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:57:57,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:57:57,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:57:57,457 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:57:57,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:57:57,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:57:57,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:57:57,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:57:57,458 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:57:57,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:57:57,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:57:57,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:57:57,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:57:57,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:57:57,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:57:57,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:57:57,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:57:57,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:57:57,460 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5335ff3ae60d503c7989a0baf091bf4ee05fe6735e77308a3563d234056465f1 [2024-11-07 01:57:57,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:57:57,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:57:57,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:57:57,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:57:57,689 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:57:57,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c [2024-11-07 01:57:58,783 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:57:59,009 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:57:59,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c [2024-11-07 01:57:59,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/415f4acd1/eabdd444d74d49cbb38cc3494f241c08/FLAG852a10509 [2024-11-07 01:57:59,333 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/415f4acd1/eabdd444d74d49cbb38cc3494f241c08 [2024-11-07 01:57:59,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:57:59,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:57:59,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:57:59,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:57:59,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:57:59,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:57:59" (1/1) ... [2024-11-07 01:57:59,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645d806d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59, skipping insertion in model container [2024-11-07 01:57:59,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:57:59" (1/1) ... [2024-11-07 01:57:59,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:57:59,470 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/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c[1175,1188] [2024-11-07 01:57:59,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:57:59,613 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:57:59,619 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/hardware-verification-bv/btor2c-lazyMod.anderson.1.prop1-func-interl.c[1175,1188] [2024-11-07 01:57:59,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:57:59,689 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:57:59,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59 WrapperNode [2024-11-07 01:57:59,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:57:59,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:57:59,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:57:59,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:57:59,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59" (1/1) ... [2024-11-07 01:57:59,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59" (1/1) ... [2024-11-07 01:57:59,793 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 921 [2024-11-07 01:57:59,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:57:59,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:57:59,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:57:59,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:57:59,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59" (1/1) ... [2024-11-07 01:57:59,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59" (1/1) ... [2024-11-07 01:57:59,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59" (1/1) ... [2024-11-07 01:57:59,840 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 01:57:59,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59" (1/1) ... [2024-11-07 01:57:59,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59" (1/1) ... [2024-11-07 01:57:59,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59" (1/1) ... [2024-11-07 01:57:59,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59" (1/1) ... [2024-11-07 01:57:59,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59" (1/1) ... [2024-11-07 01:57:59,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59" (1/1) ... [2024-11-07 01:57:59,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:57:59,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:57:59,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:57:59,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:57:59,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59" (1/1) ... [2024-11-07 01:57:59,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:57:59,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:57:59,907 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 01:57:59,910 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 01:57:59,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:57:59,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 01:57:59,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:57:59,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:58:00,085 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:58:00,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:58:01,536 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-11-07 01:58:01,536 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:58:01,542 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:58:01,542 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 01:58:01,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:58:01 BoogieIcfgContainer [2024-11-07 01:58:01,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:58:01,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:58:01,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:58:01,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:58:01,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:57:59" (1/3) ... [2024-11-07 01:58:01,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dba61d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:58:01, skipping insertion in model container [2024-11-07 01:58:01,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:57:59" (2/3) ... [2024-11-07 01:58:01,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dba61d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:58:01, skipping insertion in model container [2024-11-07 01:58:01,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:58:01" (3/3) ... [2024-11-07 01:58:01,555 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.anderson.1.prop1-func-interl.c [2024-11-07 01:58:01,566 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:58:01,567 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 01:58:01,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:58:01,607 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;@7cb90ce3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:58:01,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 01:58:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:58:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 01:58:01,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:58:01,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 01:58:01,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:58:01,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:58:01,621 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 01:58:01,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 01:58:01,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615856919] [2024-11-07 01:58:01,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:58:01,629 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 01:58:01,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 01:58:01,631 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 01:58:01,633 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 01:58:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:58:01,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 01:58:01,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:58:02,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:58:02,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:58:02,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 01:58:02,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615856919] [2024-11-07 01:58:02,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615856919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:58:02,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:58:02,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 01:58:02,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405583494] [2024-11-07 01:58:02,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:58:02,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:58:02,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 01:58:02,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:58:02,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:58:02,064 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:58:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:58:02,433 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-07 01:58:02,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:58:02,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 01:58:02,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:58:02,438 INFO L225 Difference]: With dead ends: 18 [2024-11-07 01:58:02,439 INFO L226 Difference]: Without dead ends: 10 [2024-11-07 01:58:02,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:58:02,441 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:58:02,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:58:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-07 01:58:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-07 01:58:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:58:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 01:58:02,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 01:58:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:58:02,458 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 01:58:02,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:58:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 01:58:02,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 01:58:02,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:58:02,459 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 01:58:02,462 INFO L552 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)] Ended with exit code 0 [2024-11-07 01:58:02,660 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 01:58:02,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:58:02,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:58:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 01:58:02,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 01:58:02,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770555151] [2024-11-07 01:58:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:58:02,662 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 01:58:02,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 01:58:02,664 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 01:58:02,665 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 01:58:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:58:03,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 01:58:03,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:58:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:58:19,317 INFO L311 TraceCheckSpWp]: Computing backward predicates...