./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul6.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.mul6.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', '5cd943ce762aff3a1020bcfbad33bdc9a1f90fe90606158db2b132c5b2ce5f40'] 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.mul6.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 5cd943ce762aff3a1020bcfbad33bdc9a1f90fe90606158db2b132c5b2ce5f40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:13:40,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:13:40,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 03:13:40,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:13:40,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:13:40,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:13:40,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:13:40,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:13:40,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:13:40,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:13:40,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:13:40,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:13:40,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:13:40,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:13:40,123 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:13:40,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:13:40,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:13:40,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:13:40,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:13:40,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:13:40,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:13:40,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:13:40,126 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:13:40,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:13:40,126 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:13:40,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:13:40,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:13:40,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:13:40,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:13:40,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:40,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:13:40,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:13:40,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:13:40,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:13:40,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:13:40,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:13:40,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:13:40,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:13:40,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:13:40,130 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 -> 5cd943ce762aff3a1020bcfbad33bdc9a1f90fe90606158db2b132c5b2ce5f40 [2024-11-07 03:13:40,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:13:40,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:13:40,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:13:40,450 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:13:40,450 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:13:40,452 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.mul6.c [2024-11-07 03:13:41,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:13:42,107 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:13:42,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul6.c [2024-11-07 03:13:42,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32072875d/47c75d883ddd45709ec19c316e200d6c/FLAG442b0729c [2024-11-07 03:13:42,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32072875d/47c75d883ddd45709ec19c316e200d6c [2024-11-07 03:13:42,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:13:42,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:13:42,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:42,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:13:42,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:13:42,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:42" (1/1) ... [2024-11-07 03:13:42,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff6efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42, skipping insertion in model container [2024-11-07 03:13:42,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:42" (1/1) ... [2024-11-07 03:13:42,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:13:42,320 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.mul6.c[1298,1311] [2024-11-07 03:13:42,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:42,403 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:13:42,412 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.mul6.c[1298,1311] [2024-11-07 03:13:42,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:42,474 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:13:42,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42 WrapperNode [2024-11-07 03:13:42,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:42,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:42,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:13:42,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:13:42,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42" (1/1) ... [2024-11-07 03:13:42,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42" (1/1) ... [2024-11-07 03:13:42,583 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 519 [2024-11-07 03:13:42,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:42,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:13:42,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:13:42,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:13:42,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42" (1/1) ... [2024-11-07 03:13:42,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42" (1/1) ... [2024-11-07 03:13:42,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42" (1/1) ... [2024-11-07 03:13:42,651 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-07 03:13:42,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42" (1/1) ... [2024-11-07 03:13:42,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42" (1/1) ... [2024-11-07 03:13:42,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42" (1/1) ... [2024-11-07 03:13:42,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42" (1/1) ... [2024-11-07 03:13:42,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42" (1/1) ... [2024-11-07 03:13:42,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42" (1/1) ... [2024-11-07 03:13:42,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:13:42,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:13:42,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:13:42,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:13:42,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42" (1/1) ... [2024-11-07 03:13:42,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:42,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:13:42,759 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 03:13:42,764 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 03:13:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:13:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:13:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 03:13:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:13:42,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:13:42,938 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:13:42,940 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:13:43,799 INFO L? ?]: Removed 211 outVars from TransFormulas that were not future-live. [2024-11-07 03:13:43,799 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:13:43,813 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:13:43,813 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:13:43,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:43 BoogieIcfgContainer [2024-11-07 03:13:43,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:13:43,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:13:43,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:13:43,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:13:43,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:13:42" (1/3) ... [2024-11-07 03:13:43,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4507249b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:43, skipping insertion in model container [2024-11-07 03:13:43,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:42" (2/3) ... [2024-11-07 03:13:43,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4507249b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:43, skipping insertion in model container [2024-11-07 03:13:43,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:43" (3/3) ... [2024-11-07 03:13:43,826 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul6.c [2024-11-07 03:13:43,840 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:13:43,840 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:13:43,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:13:43,909 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;@29433c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:13:43,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:13:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 132 states have (on average 1.4924242424242424) internal successors, (197), 133 states have internal predecessors, (197), 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 03:13:43,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 03:13:43,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:43,922 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] [2024-11-07 03:13:43,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:43,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:43,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1749147305, now seen corresponding path program 1 times [2024-11-07 03:13:43,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:43,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865476209] [2024-11-07 03:13:43,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:44,651 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 03:13:44,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:44,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865476209] [2024-11-07 03:13:44,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865476209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:44,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:44,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:13:44,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517801634] [2024-11-07 03:13:44,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:44,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:13:44,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:44,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:13:44,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:44,685 INFO L87 Difference]: Start difference. First operand has 134 states, 132 states have (on average 1.4924242424242424) internal successors, (197), 133 states have internal predecessors, (197), 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 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 03:13:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:44,758 INFO L93 Difference]: Finished difference Result 225 states and 333 transitions. [2024-11-07 03:13:44,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:13:44,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2024-11-07 03:13:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:44,772 INFO L225 Difference]: With dead ends: 225 [2024-11-07 03:13:44,772 INFO L226 Difference]: Without dead ends: 133 [2024-11-07 03:13:44,775 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 03:13:44,779 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 567 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 03:13:44,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 567 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-07 03:13:44,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-07 03:13:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 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 03:13:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 195 transitions. [2024-11-07 03:13:44,819 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 195 transitions. Word has length 39 [2024-11-07 03:13:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:44,819 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 195 transitions. [2024-11-07 03:13:44,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 03:13:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 195 transitions. [2024-11-07 03:13:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 03:13:44,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:44,821 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] [2024-11-07 03:13:44,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:13:44,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:44,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1609313019, now seen corresponding path program 1 times [2024-11-07 03:13:44,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:44,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214800249] [2024-11-07 03:13:44,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:44,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:45,074 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 03:13:45,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:45,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214800249] [2024-11-07 03:13:45,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214800249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:45,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:45,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:13:45,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152511768] [2024-11-07 03:13:45,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:45,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:13:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:45,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:13:45,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:45,079 INFO L87 Difference]: Start difference. First operand 133 states and 195 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 03:13:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:45,133 INFO L93 Difference]: Finished difference Result 226 states and 331 transitions. [2024-11-07 03:13:45,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:13:45,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2024-11-07 03:13:45,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:45,134 INFO L225 Difference]: With dead ends: 226 [2024-11-07 03:13:45,134 INFO L226 Difference]: Without dead ends: 135 [2024-11-07 03:13:45,135 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 03:13:45,136 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 563 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 03:13:45,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 563 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-07 03:13:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-07 03:13:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.4701492537313432) internal successors, (197), 134 states have internal predecessors, (197), 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 03:13:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 197 transitions. [2024-11-07 03:13:45,151 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 197 transitions. Word has length 40 [2024-11-07 03:13:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:45,151 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 197 transitions. [2024-11-07 03:13:45,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 03:13:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 197 transitions. [2024-11-07 03:13:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 03:13:45,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:45,155 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] [2024-11-07 03:13:45,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:13:45,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:45,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash 552938242, now seen corresponding path program 1 times [2024-11-07 03:13:45,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:45,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141702029] [2024-11-07 03:13:45,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:45,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:45,595 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 03:13:45,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:45,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141702029] [2024-11-07 03:13:45,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141702029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:45,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:45,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:13:45,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966000566] [2024-11-07 03:13:45,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:45,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:13:45,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:45,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:13:45,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:13:45,596 INFO L87 Difference]: Start difference. First operand 135 states and 197 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 03:13:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:45,680 INFO L93 Difference]: Finished difference Result 265 states and 383 transitions. [2024-11-07 03:13:45,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:13:45,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 41 [2024-11-07 03:13:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:45,683 INFO L225 Difference]: With dead ends: 265 [2024-11-07 03:13:45,683 INFO L226 Difference]: Without dead ends: 172 [2024-11-07 03:13:45,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 03:13:45,684 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 79 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:45,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 683 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-07 03:13:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 153. [2024-11-07 03:13:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 152 states have internal predecessors, (223), 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 03:13:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2024-11-07 03:13:45,703 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 41 [2024-11-07 03:13:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:45,704 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2024-11-07 03:13:45,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 03:13:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2024-11-07 03:13:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 03:13:45,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:45,705 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] [2024-11-07 03:13:45,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:13:45,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:45,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:45,706 INFO L85 PathProgramCache]: Analyzing trace with hash 870103340, now seen corresponding path program 1 times [2024-11-07 03:13:45,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:45,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848208283] [2024-11-07 03:13:45,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:45,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:46,080 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 03:13:46,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:46,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848208283] [2024-11-07 03:13:46,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848208283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:46,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:46,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:13:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828935815] [2024-11-07 03:13:46,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:46,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:13:46,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:46,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:13:46,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:13:46,081 INFO L87 Difference]: Start difference. First operand 153 states and 223 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 03:13:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:46,199 INFO L93 Difference]: Finished difference Result 267 states and 385 transitions. [2024-11-07 03:13:46,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:13:46,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 42 [2024-11-07 03:13:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:46,201 INFO L225 Difference]: With dead ends: 267 [2024-11-07 03:13:46,201 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 03:13:46,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:13:46,202 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 80 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:46,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1042 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:13:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 03:13:46,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 156. [2024-11-07 03:13:46,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4645161290322581) internal successors, (227), 155 states have internal predecessors, (227), 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 03:13:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 227 transitions. [2024-11-07 03:13:46,217 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 227 transitions. Word has length 42 [2024-11-07 03:13:46,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:46,218 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 227 transitions. [2024-11-07 03:13:46,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 03:13:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 227 transitions. [2024-11-07 03:13:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-07 03:13:46,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:46,219 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] [2024-11-07 03:13:46,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:13:46,223 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:46,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1522746271, now seen corresponding path program 1 times [2024-11-07 03:13:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:46,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092093538] [2024-11-07 03:13:46,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:46,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:46,781 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 03:13:46,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092093538] [2024-11-07 03:13:46,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092093538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:46,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:46,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 03:13:46,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900520441] [2024-11-07 03:13:46,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:46,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 03:13:46,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:46,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 03:13:46,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:13:46,786 INFO L87 Difference]: Start difference. First operand 156 states and 227 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 03:13:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:46,944 INFO L93 Difference]: Finished difference Result 267 states and 384 transitions. [2024-11-07 03:13:46,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:13:46,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 43 [2024-11-07 03:13:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:46,946 INFO L225 Difference]: With dead ends: 267 [2024-11-07 03:13:46,947 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 03:13:46,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-07 03:13:46,949 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 77 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:46,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1200 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:13:46,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 03:13:46,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 160. [2024-11-07 03:13:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.4591194968553458) internal successors, (232), 159 states have internal predecessors, (232), 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 03:13:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 232 transitions. [2024-11-07 03:13:46,963 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 232 transitions. Word has length 43 [2024-11-07 03:13:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:46,963 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 232 transitions. [2024-11-07 03:13:46,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 03:13:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 232 transitions. [2024-11-07 03:13:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 03:13:46,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:46,964 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] [2024-11-07 03:13:46,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 03:13:46,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:46,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:46,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1525039467, now seen corresponding path program 1 times [2024-11-07 03:13:46,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:46,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469959498] [2024-11-07 03:13:46,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:46,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:13:47,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:13:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:13:47,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:13:47,086 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:13:47,086 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:13:47,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 03:13:47,092 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 03:13:47,152 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:13:47,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:13:47 BoogieIcfgContainer [2024-11-07 03:13:47,158 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:13:47,159 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:13:47,159 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:13:47,159 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:13:47,160 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:43" (3/4) ... [2024-11-07 03:13:47,162 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:13:47,162 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:13:47,164 INFO L158 Benchmark]: Toolchain (without parser) took 5016.99ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 91.3MB in the beginning and 84.7MB in the end (delta: 6.6MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2024-11-07 03:13:47,164 INFO L158 Benchmark]: CDTParser took 1.36ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:13:47,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.65ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 74.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:13:47,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.25ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 67.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:13:47,165 INFO L158 Benchmark]: Boogie Preprocessor took 133.60ms. Allocated memory is still 117.4MB. Free memory was 67.3MB in the beginning and 62.7MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:13:47,165 INFO L158 Benchmark]: RCFGBuilder took 1095.28ms. Allocated memory is still 117.4MB. Free memory was 62.7MB in the beginning and 52.2MB in the end (delta: 10.5MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-11-07 03:13:47,167 INFO L158 Benchmark]: TraceAbstraction took 3339.78ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 51.7MB in the beginning and 84.8MB in the end (delta: -33.1MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-11-07 03:13:47,167 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 167.8MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 41.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:13:47,169 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.65ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 74.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.25ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 67.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 133.60ms. Allocated memory is still 117.4MB. Free memory was 67.3MB in the beginning and 62.7MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1095.28ms. Allocated memory is still 117.4MB. Free memory was 62.7MB in the beginning and 52.2MB in the end (delta: 10.5MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3339.78ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 51.7MB in the beginning and 84.8MB in the end (delta: -33.1MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 167.8MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 41.3kB). 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: 22]: 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 bitwiseOr at line 111, overapproximation of bitwiseAnd at line 116. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 64); [L31] const SORT_5 msb_SORT_5 = (SORT_5)1 << (64 - 1); [L33] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L34] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L36] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 128); [L37] const SORT_14 msb_SORT_14 = (SORT_14)1 << (128 - 1); [L39] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 32); [L40] const SORT_57 msb_SORT_57 = (SORT_57)1 << (32 - 1); [L42] const SORT_1 var_10 = 0; [L43] const SORT_14 var_15 = 0; [L44] const SORT_1 var_24 = 1; [L45] const SORT_5 var_28 = 0; [L46] const SORT_8 var_35 = 0; [L47] const SORT_57 var_58 = 1; [L48] const SORT_57 var_62 = 1000; [L49] const SORT_5 var_64 = 9223372036854775807; [L50] const SORT_5 var_67 = 12245771; [L52] SORT_1 input_2; [L53] SORT_1 input_3; [L54] SORT_1 input_4; [L55] SORT_5 input_6; [L56] SORT_5 input_7; [L57] SORT_8 input_9; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L59] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uint128() & mask_SORT_14 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L60] SORT_14 state_16 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L61] EXPR __VERIFIER_nondet_uint128() & mask_SORT_14 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L61] SORT_14 state_18 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L62] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L62] SORT_5 state_29 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L63] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L63] SORT_5 state_31 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L64] EXPR __VERIFIER_nondet_ushort() & mask_SORT_8 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L64] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L65] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L66] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L67] SORT_5 state_42 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L68] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L68] SORT_5 state_44 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L70] SORT_1 init_12_arg_1 = var_10; [L71] state_11 = init_12_arg_1 [L72] SORT_14 init_17_arg_1 = var_15; [L73] state_16 = init_17_arg_1 [L74] SORT_14 init_19_arg_1 = var_15; [L75] state_18 = init_19_arg_1 [L76] SORT_5 init_30_arg_1 = var_28; [L77] state_29 = init_30_arg_1 [L78] SORT_5 init_32_arg_1 = var_28; [L79] state_31 = init_32_arg_1 [L80] SORT_8 init_37_arg_1 = var_35; [L81] state_36 = init_37_arg_1 [L82] SORT_1 init_39_arg_1 = var_24; [L83] state_38 = init_39_arg_1 [L84] SORT_1 init_41_arg_1 = var_24; [L85] state_40 = init_41_arg_1 [L86] SORT_5 init_43_arg_1 = var_28; [L87] state_42 = init_43_arg_1 [L88] SORT_5 init_45_arg_1 = var_28; [L89] state_44 = init_45_arg_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] EXPR input_4 & mask_SORT_1 VAL [input_3=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] EXPR input_6 & mask_SORT_5 VAL [input_3=0, input_4=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] EXPR input_7 & mask_SORT_5 VAL [input_3=0, input_4=0, input_6=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_21_arg_0=-1, var_21_arg_1=1, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] EXPR var_21_arg_0 | var_21_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L116] EXPR var_26_arg_0 & var_26_arg_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] EXPR var_26 & mask_SORT_1 VAL [input_3=0, input_4=0, input_6=0, input_7=0, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 134 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 4055 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3121 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 934 mSDtfsCounter, 199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=5, InterpolantAutomatonStates: 28, 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, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 03:13:47,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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.mul6.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 5cd943ce762aff3a1020bcfbad33bdc9a1f90fe90606158db2b132c5b2ce5f40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:13:49,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:13:49,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 03:13:49,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:13:49,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:13:49,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:13:49,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:13:49,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:13:49,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:13:49,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:13:49,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:13:49,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:13:49,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:13:49,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:13:49,661 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:13:49,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:13:49,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:13:49,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:13:49,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:13:49,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:13:49,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:13:49,662 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:13:49,662 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:13:49,662 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:13:49,662 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:13:49,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:13:49,663 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:13:49,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:13:49,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:13:49,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:13:49,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:13:49,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:49,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:13:49,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:13:49,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:13:49,664 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:13:49,664 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:13:49,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:13:49,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:13:49,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:13:49,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:13:49,666 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 -> 5cd943ce762aff3a1020bcfbad33bdc9a1f90fe90606158db2b132c5b2ce5f40 [2024-11-07 03:13:50,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:13:50,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:13:50,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:13:50,181 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:13:50,182 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:13:50,183 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.mul6.c [2024-11-07 03:13:51,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:13:51,873 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:13:51,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul6.c [2024-11-07 03:13:51,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa8ae1826/ee481e42ffee4e8e85b07e6335418778/FLAGdb7afc5e5 [2024-11-07 03:13:51,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa8ae1826/ee481e42ffee4e8e85b07e6335418778 [2024-11-07 03:13:51,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:13:51,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:13:51,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:51,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:13:51,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:13:51,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:51" (1/1) ... [2024-11-07 03:13:51,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eac6fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:51, skipping insertion in model container [2024-11-07 03:13:51,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:51" (1/1) ... [2024-11-07 03:13:51,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:13:52,106 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.mul6.c[1298,1311] [2024-11-07 03:13:52,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:52,201 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:13:52,215 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.mul6.c[1298,1311] [2024-11-07 03:13:52,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:52,273 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:13:52,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:52 WrapperNode [2024-11-07 03:13:52,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:52,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:52,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:13:52,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:13:52,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:52" (1/1) ... [2024-11-07 03:13:52,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:52" (1/1) ... [2024-11-07 03:13:52,338 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 271 [2024-11-07 03:13:52,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:52,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:13:52,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:13:52,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:13:52,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:52" (1/1) ... [2024-11-07 03:13:52,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:52" (1/1) ... [2024-11-07 03:13:52,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:52" (1/1) ... [2024-11-07 03:13:52,395 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-07 03:13:52,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:52" (1/1) ... [2024-11-07 03:13:52,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:52" (1/1) ... [2024-11-07 03:13:52,411 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:52" (1/1) ... [2024-11-07 03:13:52,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:52" (1/1) ... [2024-11-07 03:13:52,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:52" (1/1) ... [2024-11-07 03:13:52,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:52" (1/1) ... [2024-11-07 03:13:52,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:13:52,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:13:52,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:13:52,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:13:52,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:52" (1/1) ... [2024-11-07 03:13:52,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:52,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:13:52,467 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 03:13:52,471 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 03:13:52,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:13:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:13:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 03:13:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:13:52,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:13:52,633 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:13:52,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:13:53,660 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-07 03:13:53,660 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:13:53,669 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:13:53,672 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:13:53,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:53 BoogieIcfgContainer [2024-11-07 03:13:53,673 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:13:53,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:13:53,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:13:53,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:13:53,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:13:51" (1/3) ... [2024-11-07 03:13:53,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c10210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:53, skipping insertion in model container [2024-11-07 03:13:53,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:52" (2/3) ... [2024-11-07 03:13:53,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c10210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:53, skipping insertion in model container [2024-11-07 03:13:53,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:53" (3/3) ... [2024-11-07 03:13:53,685 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul6.c [2024-11-07 03:13:53,700 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:13:53,700 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:13:53,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:13:53,752 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;@7fc923df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:13:53,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:13:53,757 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 03:13:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 03:13:53,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:53,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 03:13:53,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:53,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:53,769 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 03:13:53,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:13:53,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93062732] [2024-11-07 03:13:53,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:53,780 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 03:13:53,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:13:53,783 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 03:13:53,784 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 03:13:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:53,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 03:13:53,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:13:54,289 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 03:13:54,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:13:54,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:13:54,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93062732] [2024-11-07 03:13:54,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93062732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:54,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:54,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:13:54,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164177669] [2024-11-07 03:13:54,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:54,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:13:54,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:13:54,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:13:54,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:54,318 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 03:13:54,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:54,736 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-07 03:13:54,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:13:54,739 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 03:13:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:54,744 INFO L225 Difference]: With dead ends: 17 [2024-11-07 03:13:54,745 INFO L226 Difference]: Without dead ends: 9 [2024-11-07 03:13:54,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:54,751 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 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.4s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:54,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 03:13:54,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-07 03:13:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-07 03:13:54,769 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 03:13:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 03:13:54,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 03:13:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:54,774 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 03:13:54,774 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 03:13:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 03:13:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 03:13:54,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:54,775 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 03:13:54,781 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 03:13:54,975 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 03:13:54,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:54,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:54,977 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 03:13:54,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:13:54,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190061163] [2024-11-07 03:13:54,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:54,977 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 03:13:54,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:13:54,981 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 03:13:54,983 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 03:13:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:55,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 03:13:55,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:13:56,156 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 03:13:56,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:14:35,773 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 03:14:35,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:14:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190061163] [2024-11-07 03:14:35,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190061163] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:14:35,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 03:14:35,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 03:14:35,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828935432] [2024-11-07 03:14:35,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 03:14:35,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 03:14:35,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:14:35,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 03:14:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:14:35,779 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 03:14:37,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:14:38,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:14:38,520 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-07 03:14:38,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:14:38,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 8 [2024-11-07 03:14:38,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:14:38,522 INFO L225 Difference]: With dead ends: 14 [2024-11-07 03:14:38,522 INFO L226 Difference]: Without dead ends: 12 [2024-11-07 03:14:38,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:14:38,522 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 03:14:38,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 03:14:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-07 03:14:38,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-07 03:14:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 03:14:38,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-07 03:14:38,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-07 03:14:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:14:38,526 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-07 03:14:38,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 03:14:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-07 03:14:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 03:14:38,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:14:38,526 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-07 03:14:38,538 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 (3)] Ended with exit code 0 [2024-11-07 03:14:38,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 03:14:38,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:14:38,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:14:38,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-07 03:14:38,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:14:38,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750556832] [2024-11-07 03:14:38,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 03:14:38,728 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 03:14:38,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:14:38,730 INFO L229 MonitoredProcess]: Starting monitored process 4 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 03:14:38,732 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 (4)] Waiting until timeout for monitored process [2024-11-07 03:14:39,585 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 03:14:39,586 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 03:14:39,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:14:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:14:40,394 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 03:14:40,394 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:14:40,395 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:14:40,424 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 (4)] Ended with exit code 0 [2024-11-07 03:14:40,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 03:14:40,601 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-07 03:14:40,649 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:14:40,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:14:40 BoogieIcfgContainer [2024-11-07 03:14:40,654 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:14:40,655 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:14:40,656 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:14:40,656 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:14:40,657 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:53" (3/4) ... [2024-11-07 03:14:40,657 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 03:14:40,724 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 03:14:40,724 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:14:40,725 INFO L158 Benchmark]: Toolchain (without parser) took 48807.43ms. Allocated memory was 83.9MB in the beginning and 201.3MB in the end (delta: 117.4MB). Free memory was 60.3MB in the beginning and 147.8MB in the end (delta: -87.5MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2024-11-07 03:14:40,726 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory was 64.4MB in the beginning and 64.4MB in the end (delta: 35.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:14:40,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.48ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 43.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:14:40,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.90ms. Allocated memory is still 83.9MB. Free memory was 43.9MB in the beginning and 41.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:14:40,727 INFO L158 Benchmark]: Boogie Preprocessor took 80.28ms. Allocated memory is still 83.9MB. Free memory was 41.5MB in the beginning and 38.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:14:40,727 INFO L158 Benchmark]: RCFGBuilder took 1248.71ms. Allocated memory is still 83.9MB. Free memory was 38.8MB in the beginning and 49.9MB in the end (delta: -11.1MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-11-07 03:14:40,727 INFO L158 Benchmark]: TraceAbstraction took 46977.11ms. Allocated memory was 83.9MB in the beginning and 201.3MB in the end (delta: 117.4MB). Free memory was 49.4MB in the beginning and 153.7MB in the end (delta: -104.3MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-07 03:14:40,728 INFO L158 Benchmark]: Witness Printer took 69.44ms. Allocated memory is still 201.3MB. Free memory was 153.7MB in the beginning and 147.8MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:14:40,730 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.27ms. Allocated memory is still 83.9MB. Free memory was 64.4MB in the beginning and 64.4MB in the end (delta: 35.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.48ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 43.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.90ms. Allocated memory is still 83.9MB. Free memory was 43.9MB in the beginning and 41.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.28ms. Allocated memory is still 83.9MB. Free memory was 41.5MB in the beginning and 38.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1248.71ms. Allocated memory is still 83.9MB. Free memory was 38.8MB in the beginning and 49.9MB in the end (delta: -11.1MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * TraceAbstraction took 46977.11ms. Allocated memory was 83.9MB in the beginning and 201.3MB in the end (delta: 117.4MB). Free memory was 49.4MB in the beginning and 153.7MB in the end (delta: -104.3MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Witness Printer took 69.44ms. Allocated memory is still 201.3MB. Free memory was 153.7MB in the beginning and 147.8MB in the end (delta: 5.9MB). 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 - CounterExampleResult [Line: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 64); [L31] const SORT_5 msb_SORT_5 = (SORT_5)1 << (64 - 1); [L33] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L34] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L36] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 128); [L37] const SORT_14 msb_SORT_14 = (SORT_14)1 << (128 - 1); [L39] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 32); [L40] const SORT_57 msb_SORT_57 = (SORT_57)1 << (32 - 1); [L42] const SORT_1 var_10 = 0; [L43] const SORT_14 var_15 = 0; [L44] const SORT_1 var_24 = 1; [L45] const SORT_5 var_28 = 0; [L46] const SORT_8 var_35 = 0; [L47] const SORT_57 var_58 = 1; [L48] const SORT_57 var_62 = 1000; [L49] const SORT_5 var_64 = 9223372036854775807; [L50] const SORT_5 var_67 = 12245771; [L52] SORT_1 input_2; [L53] SORT_1 input_3; [L54] SORT_1 input_4; [L55] SORT_5 input_6; [L56] SORT_5 input_7; [L57] SORT_8 input_9; [L59] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] SORT_14 state_16 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L61] SORT_14 state_18 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L62] SORT_5 state_29 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L63] SORT_5 state_31 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L64] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L65] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] SORT_5 state_42 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L68] SORT_5 state_44 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L70] SORT_1 init_12_arg_1 = var_10; [L71] state_11 = init_12_arg_1 [L72] SORT_14 init_17_arg_1 = var_15; [L73] state_16 = init_17_arg_1 [L74] SORT_14 init_19_arg_1 = var_15; [L75] state_18 = init_19_arg_1 [L76] SORT_5 init_30_arg_1 = var_28; [L77] state_29 = init_30_arg_1 [L78] SORT_5 init_32_arg_1 = var_28; [L79] state_31 = init_32_arg_1 [L80] SORT_8 init_37_arg_1 = var_35; [L81] state_36 = init_37_arg_1 [L82] SORT_1 init_39_arg_1 = var_24; [L83] state_38 = init_39_arg_1 [L84] SORT_1 init_41_arg_1 = var_24; [L85] state_40 = init_41_arg_1 [L86] SORT_5 init_43_arg_1 = var_28; [L87] state_42 = init_43_arg_1 [L88] SORT_5 init_45_arg_1 = var_28; [L89] state_44 = init_45_arg_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND FALSE !(!(cond)) [L119] RET __VERIFIER_assert(!(bad_27_arg_0)) [L121] SORT_1 next_51_arg_1 = var_24; [L122] SORT_1 var_33_arg_0 = state_11; [L123] SORT_1 var_33 = ~var_33_arg_0; [L124] var_33 = var_33 & mask_SORT_1 [L125] SORT_5 var_52_arg_0 = state_29; [L126] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L127] SORT_14 var_52 = var_52_arg_0; [L128] SORT_5 var_53_arg_0 = state_31; [L129] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L130] SORT_14 var_53 = var_53_arg_0; [L131] SORT_14 var_54_arg_0 = var_52; [L132] SORT_14 var_54_arg_1 = var_53; [L133] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L134] SORT_1 var_55_arg_0 = var_33; [L135] SORT_14 var_55_arg_1 = var_15; [L136] SORT_14 var_55_arg_2 = var_54; [L137] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L138] var_55 = var_55 & mask_SORT_14 [L139] SORT_14 next_56_arg_1 = var_55; [L140] SORT_1 var_71_arg_0 = state_38; [L141] SORT_1 var_71_arg_1 = state_40; [L142] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L143] var_71 = var_71 & mask_SORT_1 [L144] SORT_8 var_61_arg_0 = state_36; [L145] var_61_arg_0 = var_61_arg_0 & mask_SORT_8 [L146] SORT_57 var_61 = var_61_arg_0; [L147] SORT_57 var_63_arg_0 = var_61; [L148] SORT_57 var_63_arg_1 = var_62; [L149] SORT_1 var_63 = var_63_arg_0 > var_63_arg_1; [L150] SORT_5 var_65_arg_0 = input_6; [L151] SORT_5 var_65_arg_1 = var_64; [L152] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L153] SORT_1 var_66_arg_0 = var_63; [L154] SORT_1 var_66_arg_1 = var_65; [L155] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L156] SORT_5 var_68_arg_0 = input_7; [L157] SORT_5 var_68_arg_1 = var_67; [L158] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L159] SORT_1 var_69_arg_0 = var_66; [L160] SORT_1 var_69_arg_1 = var_68; [L161] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L162] var_69 = var_69 & mask_SORT_1 [L163] SORT_5 var_46_arg_0 = state_42; [L164] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L165] SORT_14 var_46 = var_46_arg_0; [L166] SORT_5 var_47_arg_0 = state_44; [L167] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L168] SORT_14 var_47 = var_47_arg_0; [L169] SORT_14 var_48_arg_0 = var_46; [L170] SORT_14 var_48_arg_1 = var_47; [L171] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L172] SORT_57 var_59_arg_0 = var_58; [L173] var_59_arg_0 = var_59_arg_0 & mask_SORT_57 [L174] SORT_14 var_59 = var_59_arg_0; [L175] SORT_14 var_60_arg_0 = var_48; [L176] SORT_14 var_60_arg_1 = var_59; [L177] SORT_14 var_60 = var_60_arg_0 + var_60_arg_1; [L178] SORT_1 var_70_arg_0 = var_69; [L179] SORT_14 var_70_arg_1 = var_60; [L180] SORT_14 var_70_arg_2 = var_48; [L181] SORT_14 var_70 = var_70_arg_0 ? var_70_arg_1 : var_70_arg_2; [L182] SORT_1 var_72_arg_0 = var_71; [L183] SORT_14 var_72_arg_1 = var_70; [L184] SORT_14 var_72_arg_2 = state_18; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] SORT_1 var_73_arg_0 = var_33; [L187] SORT_14 var_73_arg_1 = var_15; [L188] SORT_14 var_73_arg_2 = var_72; [L189] SORT_14 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L190] var_73 = var_73 & mask_SORT_14 [L191] SORT_14 next_74_arg_1 = var_73; [L192] SORT_1 var_75_arg_0 = input_3; [L193] SORT_5 var_75_arg_1 = input_6; [L194] SORT_5 var_75_arg_2 = state_29; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_1 var_76_arg_0 = var_33; [L197] SORT_5 var_76_arg_1 = var_28; [L198] SORT_5 var_76_arg_2 = var_75; [L199] SORT_5 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; [L200] SORT_5 next_77_arg_1 = var_76; [L201] SORT_1 var_78_arg_0 = input_4; [L202] SORT_5 var_78_arg_1 = input_7; [L203] SORT_5 var_78_arg_2 = state_31; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_79_arg_0 = var_33; [L206] SORT_5 var_79_arg_1 = var_28; [L207] SORT_5 var_79_arg_2 = var_78; [L208] SORT_5 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L209] SORT_5 next_80_arg_1 = var_79; [L210] SORT_1 var_81_arg_0 = var_33; [L211] SORT_8 var_81_arg_1 = input_9; [L212] SORT_8 var_81_arg_2 = state_36; [L213] SORT_8 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L214] SORT_8 next_82_arg_1 = var_81; [L215] SORT_1 var_83_arg_0 = var_33; [L216] SORT_1 var_83_arg_1 = var_24; [L217] SORT_1 var_83_arg_2 = input_3; [L218] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L219] SORT_1 next_84_arg_1 = var_83; [L220] SORT_1 var_85_arg_0 = var_33; [L221] SORT_1 var_85_arg_1 = var_24; [L222] SORT_1 var_85_arg_2 = input_4; [L223] SORT_1 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L224] SORT_1 next_86_arg_1 = var_85; [L225] SORT_1 var_87_arg_0 = input_3; [L226] SORT_5 var_87_arg_1 = input_6; [L227] SORT_5 var_87_arg_2 = state_42; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_1 var_88_arg_0 = var_33; [L230] SORT_5 var_88_arg_1 = var_28; [L231] SORT_5 var_88_arg_2 = var_87; [L232] SORT_5 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L233] SORT_5 next_89_arg_1 = var_88; [L234] SORT_1 var_90_arg_0 = input_4; [L235] SORT_5 var_90_arg_1 = input_7; [L236] SORT_5 var_90_arg_2 = state_44; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_1 var_91_arg_0 = var_33; [L239] SORT_5 var_91_arg_1 = var_28; [L240] SORT_5 var_91_arg_2 = var_90; [L241] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L242] SORT_5 next_92_arg_1 = var_91; [L244] state_11 = next_51_arg_1 [L245] state_16 = next_56_arg_1 [L246] state_18 = next_74_arg_1 [L247] state_29 = next_77_arg_1 [L248] state_31 = next_80_arg_1 [L249] state_36 = next_82_arg_1 [L250] state_38 = next_84_arg_1 [L251] state_40 = next_86_arg_1 [L252] state_42 = next_89_arg_1 [L253] state_44 = next_92_arg_1 [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND FALSE !(!(cond)) [L119] RET __VERIFIER_assert(!(bad_27_arg_0)) [L121] SORT_1 next_51_arg_1 = var_24; [L122] SORT_1 var_33_arg_0 = state_11; [L123] SORT_1 var_33 = ~var_33_arg_0; [L124] var_33 = var_33 & mask_SORT_1 [L125] SORT_5 var_52_arg_0 = state_29; [L126] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L127] SORT_14 var_52 = var_52_arg_0; [L128] SORT_5 var_53_arg_0 = state_31; [L129] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L130] SORT_14 var_53 = var_53_arg_0; [L131] SORT_14 var_54_arg_0 = var_52; [L132] SORT_14 var_54_arg_1 = var_53; [L133] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L134] SORT_1 var_55_arg_0 = var_33; [L135] SORT_14 var_55_arg_1 = var_15; [L136] SORT_14 var_55_arg_2 = var_54; [L137] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L138] var_55 = var_55 & mask_SORT_14 [L139] SORT_14 next_56_arg_1 = var_55; [L140] SORT_1 var_71_arg_0 = state_38; [L141] SORT_1 var_71_arg_1 = state_40; [L142] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L143] var_71 = var_71 & mask_SORT_1 [L144] SORT_8 var_61_arg_0 = state_36; [L145] var_61_arg_0 = var_61_arg_0 & mask_SORT_8 [L146] SORT_57 var_61 = var_61_arg_0; [L147] SORT_57 var_63_arg_0 = var_61; [L148] SORT_57 var_63_arg_1 = var_62; [L149] SORT_1 var_63 = var_63_arg_0 > var_63_arg_1; [L150] SORT_5 var_65_arg_0 = input_6; [L151] SORT_5 var_65_arg_1 = var_64; [L152] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L153] SORT_1 var_66_arg_0 = var_63; [L154] SORT_1 var_66_arg_1 = var_65; [L155] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L156] SORT_5 var_68_arg_0 = input_7; [L157] SORT_5 var_68_arg_1 = var_67; [L158] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L159] SORT_1 var_69_arg_0 = var_66; [L160] SORT_1 var_69_arg_1 = var_68; [L161] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L162] var_69 = var_69 & mask_SORT_1 [L163] SORT_5 var_46_arg_0 = state_42; [L164] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L165] SORT_14 var_46 = var_46_arg_0; [L166] SORT_5 var_47_arg_0 = state_44; [L167] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L168] SORT_14 var_47 = var_47_arg_0; [L169] SORT_14 var_48_arg_0 = var_46; [L170] SORT_14 var_48_arg_1 = var_47; [L171] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L172] SORT_57 var_59_arg_0 = var_58; [L173] var_59_arg_0 = var_59_arg_0 & mask_SORT_57 [L174] SORT_14 var_59 = var_59_arg_0; [L175] SORT_14 var_60_arg_0 = var_48; [L176] SORT_14 var_60_arg_1 = var_59; [L177] SORT_14 var_60 = var_60_arg_0 + var_60_arg_1; [L178] SORT_1 var_70_arg_0 = var_69; [L179] SORT_14 var_70_arg_1 = var_60; [L180] SORT_14 var_70_arg_2 = var_48; [L181] SORT_14 var_70 = var_70_arg_0 ? var_70_arg_1 : var_70_arg_2; [L182] SORT_1 var_72_arg_0 = var_71; [L183] SORT_14 var_72_arg_1 = var_70; [L184] SORT_14 var_72_arg_2 = state_18; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] SORT_1 var_73_arg_0 = var_33; [L187] SORT_14 var_73_arg_1 = var_15; [L188] SORT_14 var_73_arg_2 = var_72; [L189] SORT_14 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L190] var_73 = var_73 & mask_SORT_14 [L191] SORT_14 next_74_arg_1 = var_73; [L192] SORT_1 var_75_arg_0 = input_3; [L193] SORT_5 var_75_arg_1 = input_6; [L194] SORT_5 var_75_arg_2 = state_29; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_1 var_76_arg_0 = var_33; [L197] SORT_5 var_76_arg_1 = var_28; [L198] SORT_5 var_76_arg_2 = var_75; [L199] SORT_5 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; [L200] SORT_5 next_77_arg_1 = var_76; [L201] SORT_1 var_78_arg_0 = input_4; [L202] SORT_5 var_78_arg_1 = input_7; [L203] SORT_5 var_78_arg_2 = state_31; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_79_arg_0 = var_33; [L206] SORT_5 var_79_arg_1 = var_28; [L207] SORT_5 var_79_arg_2 = var_78; [L208] SORT_5 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L209] SORT_5 next_80_arg_1 = var_79; [L210] SORT_1 var_81_arg_0 = var_33; [L211] SORT_8 var_81_arg_1 = input_9; [L212] SORT_8 var_81_arg_2 = state_36; [L213] SORT_8 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L214] SORT_8 next_82_arg_1 = var_81; [L215] SORT_1 var_83_arg_0 = var_33; [L216] SORT_1 var_83_arg_1 = var_24; [L217] SORT_1 var_83_arg_2 = input_3; [L218] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L219] SORT_1 next_84_arg_1 = var_83; [L220] SORT_1 var_85_arg_0 = var_33; [L221] SORT_1 var_85_arg_1 = var_24; [L222] SORT_1 var_85_arg_2 = input_4; [L223] SORT_1 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L224] SORT_1 next_86_arg_1 = var_85; [L225] SORT_1 var_87_arg_0 = input_3; [L226] SORT_5 var_87_arg_1 = input_6; [L227] SORT_5 var_87_arg_2 = state_42; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_1 var_88_arg_0 = var_33; [L230] SORT_5 var_88_arg_1 = var_28; [L231] SORT_5 var_88_arg_2 = var_87; [L232] SORT_5 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L233] SORT_5 next_89_arg_1 = var_88; [L234] SORT_1 var_90_arg_0 = input_4; [L235] SORT_5 var_90_arg_1 = input_7; [L236] SORT_5 var_90_arg_2 = state_44; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_1 var_91_arg_0 = var_33; [L239] SORT_5 var_91_arg_1 = var_28; [L240] SORT_5 var_91_arg_2 = var_90; [L241] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L242] SORT_5 next_92_arg_1 = var_91; [L244] state_11 = next_51_arg_1 [L245] state_16 = next_56_arg_1 [L246] state_18 = next_74_arg_1 [L247] state_29 = next_77_arg_1 [L248] state_31 = next_80_arg_1 [L249] state_36 = next_82_arg_1 [L250] state_38 = next_84_arg_1 [L251] state_40 = next_86_arg_1 [L252] state_42 = next_89_arg_1 [L253] state_44 = next_92_arg_1 [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.9s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 9 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 40.8s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 18 ConstructedInterpolants, 4 QuantifiedInterpolants, 754 SizeOfPredicates, 26 NumberOfNonLiveVariables, 191 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/4 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 proved your program to be incorrect! [2024-11-07 03:14:40,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE